Analysis of Neuronal Dendrite Patterns Using Eigenvalues of Graph Laplacians
نویسنده
چکیده
We report our current effort on extracting morphological features from neuronal dendrite patterns using the eigenvalues of their graph Laplacians and clustering neurons using those features into different functional cell types. Our preliminary results indicate the potential usefulness of such eigenvalue-based features, which we hope to replace the morphological features extracted by methods that require extensive human interactions.
منابع مشابه
High-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملLaplacian and vibrational spectra for homogeneous graphs
A homogeneous graph is a graph together with a group which acts transitively on vertices as symmetries of the graph. We consider Laplacians of homogeneous graphs and generalizations of Laplacians whose eigenvalues can be associated with various equilibria of forces in molecules (such as vibrational modes of buckyballs). Methods are given for calculating such eigenvalues by combining concepts an...
متن کاملTechnical Report: Using Laplacian Methods, RKHS Smoothing Splines and Bayesian Estimation as a framework for Regression on Graph and Graph Related Domains
1 Laplacian Methods: An Overview 2 1.1 De nition: The Laplacian operator of a Graph . . . . . . . . . . 2 1.2 Properties of the Laplacian and its Spectrum . . . . . . . . . . . 4 1.2.1 Spectrum of L and e L: Graph eigenvalues and eigenvectors: 4 1.2.2 Other interesting / useful properties of the normalized Laplacian (Chung): . . . . . . . . . . . . . . . . . . . . . 6 1.2.3 Laplacians of Weight...
متن کاملLaplacians for flow networks
We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
متن کاملWeighted Graph Laplacians and Isoperimetric Inequalities
We consider a weighted Cheeger’s constant for a graph and we examine the gap between the first two eigenvalues of Laplacian. We establish several isoperimetric inequalities concerning the unweighted Cheeger’s constant, weighted Cheeger’s constants and eigenvalues for Neumann and Dirichlet conditions .
متن کامل